The computational efficiency of non-linear frequency domain methods

نویسندگان

  • Matthew S. McMullen
  • Antony Jameson
چکیده

This paper demonstrates efficient solver technologies applied to the non-linear frequency domain (NLFD) method. The basis of the NLFD method is to assume the time period of the solution s oscillation and to transform both the solution and residual using a discrete Fourier transform. An unsteady residual is formed in the frequency domain and iteratively driven to a negligible value. This method is amenable to many of the convergence acceleration techniques used for steady state flows including pseudo-local time stepping, implicit residual averaging, coarse grid viscosity and multigrid. This paper will address the implementation of these techniques such that convergence rates of the modified unsteady solver are equivalent to those of the original steady-state techniques. 2005 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Updating finite element model using frequency domain decomposition method and bees algorithm

The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...

متن کامل

Attenuation of spatial aliasing in CMP domain by non-linear interpolation of seismic data along local slopes

Spatial aliasing is an unwanted side effect that produces artifacts during seismic data processing, imaging and interpolation. It is often caused by insufficient spatial sampling of seismic data and often happens in CMP (Common Mid-Point) gather. To tackle this artifact, several techniques have been developed in time-space domain as well as frequency domain such as frequency-wavenumber, frequen...

متن کامل

Linear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints

In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...

متن کامل

A comparison between modal damping ratios identified by NExT-ERA and frequency domain impact test

In this research, the modal parameters of a beam in free-free condition are extracted by performing different experiments in laboratory. For this purpose, two different techniques are employed. The first methodology is considered as a time domain method in Operational Modal Analysis. While the other one is frequency domain impact hammer test which is categorized as an Experimental Modal Analysi...

متن کامل

Antenna Design and Non Linear Simulation of Rectifier for Wideband and Multi-Tone Radio Frequency Energy Harvesting

In this paper, a wideband rectenna without using matching networks is presented. In addition of wide bandwidth, the omnidirectional radiation pattern, maximum radio frequency to dc conversion efficiency, harvesting capability of the minimum input power level, easy fabrication process cause this antenna be a good choice for radio frequency energy harvesting applications. Matching network has bee...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Physics

دوره 212  شماره 

صفحات  -

تاریخ انتشار 2006